Numerical Experiments with the LLL-Based Hermite Normal Form Algorithm for Solving Linear Diophantine Systems
نویسنده
چکیده
In this paper we are concerned with the practical performance of the LLL-based Hermite normal form algorithm, proposed by Havas [13] (LLLHMM) when applied to solve linear Diophantine systems. We first compare the efficiency of the LLLHMM with the algorithm, named LDSSBR, based on the Rosser’s idea. The numerical results show that for small problems, the bit length of the longest integer occurring during the execution of the LDSSBR (Bmax) and the computing time are less than those of the LLLHMM. As the size of the problem increases the gap between Bmax and the computing time of both algorithms reduces and for large problems Bmax and the computing time of the LLLHMM are less than those of the LDSSBR. Therefore, in sense of controlling the growth of intermediate results and the computing time for small problems the LDSSBR is more efficient while, for large problems the LLLHMM is more efficient. However, for all test problems the bit length of the maximum absolute value of the components of the particular solution and basis, obtained by using the LLLHMM is significantly less than those of the LDSSBR. Then, by presenting some tables of empirical results we justify the experimental conjecture that if the bit length of the components of the coefficient matrix and the right hand side vector of the Diophantine system are equal to k then the nearest integer to the bit length the maximum absolute value of the components of the particular solution and the basis obtained after an application of the LLLHMM is approximately mk/(n−m), where m denotes the number of equations and n denotes the number of variables of the system. Mathematics Subject Classification: 11Y50, 11D04, 15A06, 65F05, 65F20 600 M. Khorramizadeh
منابع مشابه
Operational matrices with respect to Hermite polynomials and their applications in solving linear differential equations with variable coefficients
In this paper, a new and efficient approach is applied for numerical approximation of the linear differential equations with variable coeffcients based on operational matrices with respect to Hermite polynomials. Explicit formulae which express the Hermite expansion coeffcients for the moments of derivatives of any differentiable function in terms of the original expansion coefficients of the f...
متن کاملGGMRES: A GMRES--type algorithm for solving singular linear equations with index one
In this paper, an algorithm based on the Drazin generalized conjugate residual (DGMRES) algorithm is proposed for computing the group-inverse solution of singular linear equations with index one. Numerical experiments show that the resulting group-inverse solution is reasonably accurate and its computation time is significantly less than that of group-inverse solution obtained by the DGMRES alg...
متن کاملAlgorithms for Large Integer Matrix Problems
New algorithms are described and analysed for solving various problems associated with a large integer matrix: computing the Hermite form, computing a kernel basis, and solving a system of linear diophantine equations. The algorithms are space-efficient and for certain types of input matrices — for example, those arising during the computation of class groups and regulators — are faster than pr...
متن کاملA numerical Algorithm Based on Chebyshev Polynomials for Solving some Inverse Source Problems
In this paper, two inverse problems of determining an unknown source term in a parabolic equation are considered. First, the unknown source term is estimated in the form of a combination of Chebyshev functions. Then, a numerical algorithm based on Chebyshev polynomials is presented for obtaining the solution of the problem. For solving the problem, the operational matrices of int...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011